The Construction of A-code from Singular Pseudo-symplectic Geometry over Finite Fields
نویسنده
چکیده
A construction of A3-code from singular pseudo-symplectic geometry over finite fields is presented. Under the assumption that the encoding rules of the transmitter, the receiver and the arbiter are chosen according to a uniform probability distribution, the parameters and the probabilities of success for different types of deceptions are computed. Key–Words: A3-codes, Singular Pseudo-symplectic Geometry , Finite fields.
منابع مشابه
New Construction of Authentication Codes with Arbitration from Pseudo-Symplectic Geometry over Finite Fields
A new construction of authentication codes with arbitration from pseudo-symplectic geometry over finite fields is given. The parameters and the probabilities of deceptions of the codes are also computed. §
متن کاملTwo Constructions of Multireceiver Authentication Codes from Singular Symplectic Geometry over Finite Fields
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, two constructions of multireceiver authentication codes from singular symplectic geometry over finite fields are given. The parameters and the probabilities of success for different types of dec...
متن کاملA New Construction of Multi-receiver Authentication Codes from Pseudo-Symplectic Geometry over Finite Fields
Multi-receiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we constructed one multi-receiver authentication codes from pseudo-symplectic geometry over finite fields. The parameters and the probabilities of deceptions of this codes are also computed.
متن کاملNonbinary quantum codes
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional global symmetries. From this standpoint, the analogues of Calderbank-Shor-Steane codes and of GF(4)-linear codes turn out to be special cases of the same const...
متن کاملA Construction of Multi-sender Authentication Codes from Pseudo-Symplectic Geometry over Finite Fields
Multisender authentication code was firstly constructed by Gilbert et al. in [1] in 1974.Multisender authentication system refers to a group of senders that cooperatively send amessage to the receiver, and then the receiver should be able to ascertain that the message is authentic. About this case, many scholars had also much researches and had made great contributions to multisender authentica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015